Equitable partition of graphs into induced linear forests
نویسندگان
چکیده
منابع مشابه
Edge Partition of Toroidal Graphs into Forests in Linear Time
In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be embedded on the orientable surface of genus one without edge crossing, into three forests plus a set of at most three edges. For triangulated toroidal graphs, this algorithm gives a linear algorithm for finding three edge-disjoint spanning trees. This is in a certain way an extension of the well...
متن کاملPartitions of some planar graphs into two linear forests
A linear forest is a forest in which every component is a path. It is known that the set of vertices V (G) of any outerplanar graph G can be partitioned into two disjoint subsets V1, V2 such that induced subgraphs 〈V1〉 and 〈V2〉 are linear forests (we say G has an (LF ,LF)partition). In this paper, we present an extension of the above result to the class of planar graphs with a given number of i...
متن کاملSimple Planar Graph Partition into Three Forests
We describe a simple way of partitioning a planar graph into three edge-disjoint forests in O(n log n) time, where n is the number of its vertices. We can use this partition in Kannan et al.‘s graph representation (1992) to label the planar graph vertices so that any two vertices’ adjacency can be tested locally by comparing their names in constant time.
متن کاملPancyclic graphs and linear forests
Given integers k, s, t with 0 ≤ s ≤ t and k ≥ 0, a (k, t, s)-linear forest F is a graph that is the vertex disjoint union of t paths with a total of k edges and with s of the paths being single vertices. If the number of single vertex paths is not critical, the forest F will simply be called a (k, t)-linear forest. A graph G of order n ≥ k + t is (k, t)-hamiltonian if for any (k, t)-linear fore...
متن کاملOn graphs decomposable into induced matchings of linear sizes
We call a graph G an (r, t)-Ruzsa–Szemerédi graph if its edge set can be partitioned into t edgedisjoint induced matchings, each of size r. These graphs were introduced in 1978 and have been extensively studied since then. In this paper, we consider the case when r = cn. For c > 1/4, we determine the maximum possible t, which is a constant depending only on c. On the other hand, when c = 1/4, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2019
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-019-00498-8